On the meanness of arbitrary path super subdivision of paths

Let G(V, E) be a graph with p vertices and q edges. For every assignment f : V (G) → {0, 1, 2, . . . , q}, consider an induced edge labeling f ∗ : E(G) → {1, 2, . . . , q} defined by f ∗(uv) = { f(u)+f(v) 2 if f(u) and f(v) are of the same parity, f(u)+f(v)+1 2 otherwise for every edge uv ∈ E(G). If f ∗(E) = {1, 2, . . . , q}, then we say that f is a mean labeling of G. If a graph G admits a mean labeling, then G is called a mean graph. In this paper, we study the meanness of arbitrary path super subdivision of the graph Pn.